A Conjecture of Erdős the Ramsey Number r(W6)
نویسندگان
چکیده
It was conjectured by Paul Erdős that if G is a graph with chromatic number at least k, then the diagonal Ramsey number r(G) ≥ r(Kk). That is, the complete graph Kk has the smallest diagonal Ramsey number among the graphs of chromatic number k. This conjecture is shown to be false for k = 4 by verifying that r(W6) = 17, where W6 is the wheel with 6 vertices, since it is well known that r(K4) = 18. Computational techniques are used to determine r(W6) as well as the Ramsey numbers for other pairs of small order wheels.
منابع مشابه
A conjecture of Erdős on graph Ramsey numbers
The Ramsey number r(G) of a graph G is the minimum N such that every red–blue coloring of the edges of the complete graph on N vertices contains a monochromatic copy of G. Determining or estimating these numbers is one of the central problems in combinatorics. One of the oldest results in Ramsey Theory, proved by Erdős and Szekeres in 1935, asserts that the Ramsey number of the complete graph w...
متن کاملThe Ramsey Numbers R(Tn, W6) for Small n∗
Let Tn denote a tree of order n and Wm a wheel of order m + 1. Baskoro et al. conjectured in [2] that if Tn is not a star, then R(Tn,Wm) = 2n − 1 for m ≥ 6 even and n ≥ m− 1. We disprove the Conjecture in [6]. In this paper, we determine R(Tn,W6) for n ≤ 8 which is the first step for us to determine R(Tn,W6) for any tree Tn.
متن کاملThe Ramsey numbers of trees versus W6 or W7
1 Let Tn denote a tree of order n and Wm a wheel of order m+1. In this paper, we show the Ramsey 2 numbers R(Tn , W6) = 2n − 1 + μ for n ≥ 5, where μ = 2 if Tn = Sn, μ = 1 if Tn = Sn(1, 1) or 3 Tn = Sn(1, 2) and n ≡ 0 (mod 3), and μ = 0 otherwise; R(Tn , W7) = 3n − 2 for n ≥ 6. 4 © 2005 Elsevier Ltd. All rights reserved. 5
متن کاملOn the function of Erdős and Rogers
The well-known Ramsey number R(t, u) is the smallest integer n such that every Kt-free graph of order n contains a subset of u vertices with no K2. Erdős and Rogers considered a more general problem replacing K2 by Ks for 2 ≤ s < t. Extending the problem of determining Ramsey numbers they defined the following function fs,t(n) = min { max{|S| : S ⊆ V (H) and H[S] contains no Ks} } , where the m...
متن کاملOn a problem of Erdős and Lovász on coloring non-uniform hypergraphs
Let f(r) = minH P F∈E(H) 1 2|F | , where H ranges over all 3-chromatic hypergraphs with minimum edge cardinality r. Erdős-Lovász (1975) conjectured f(r) → ∞ as r → ∞. This conjecture was proved by Beck in 1978. Here we show a new proof for this conjecture with a better lower bound: f(r) ≥ ( 1 16 − o(1)) ln r ln ln r .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996